Every graph admits an unambiguous bold drawingA preliminary versionP12 of this paper was presented at the 19th International Symposium on Graph Drawing, Eindhoven, 2011
نویسنده
چکیده
Let r and w be fixed positive numbers, w < r. In a bold drawing of a graph, every vertex is represented by a disk of radius r, and every edge by a narrow rectangle of width w. We solve a problem of van Kreveld [10] by showing that every graph admits a bold drawing in which the region occupied by the union of the disks and rectangles representing the vertices and edges does not contain any disk of radius r other than the ones representing the vertices. Submitted: August 2013 Reviewed: March 2014 Revised: February 2015 Accepted: February 2015 Final: June 2015 Published: June 2015 Article type: Regular paper Communicated by: S. Kobourov E-mail address: [email protected] (János Pach) 1A preliminary version[8] of this paper was presented at the 19th International Symposium on Graph Drawing, Eindhoven, 2011. 300 János Pach Every graph admits an unambiguous bold drawing
منابع مشابه
Every Graph Admits an Unambiguous Bold Drawing
Let r and w be a fixed positive numbers, w < r. In a bold drawing of a graph, every vertex is represented by a disk of radius r, and every edge by a narrow rectangle of width w. We solve a problem of van Kreveld [K09] by showing that every graph admits a bold drawing in which the region occupied by the union of the disks and rectangles representing the vertices and edges does not contain any di...
متن کاملApproximate Proximity Drawings
We introduce and study a generalization of the well-known region of influence proximity drawings, called (ε1, ε2)-proximity drawings. Intuitively, given a definition of proximity and two real numbers ε1 ≥ 0 and ε2 ≥ 0, an (ε1, ε2)-proximity drawing of a graph is a planar straight-line drawing Γ such that: (i) for every pair of adjacent vertices u, v, their proximity region “shrunk” by the multi...
متن کاملGeneralizing Geometric Graphs
Network visualization is essential for understanding the data obtained from huge real-world networks such as flight-networks, the AS-network or social networks. Although we can compute layouts for these networks reasonably fast, even the most recent display media are not capable of displaying these layouts in an adequate way. Moreover, the human viewer may be overwhelmed by the displayed level ...
متن کاملStraight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
Trees are usually drawn planar, i.e. without any edge-crossings. In this paper, we investigate the area requirement of (non-upward) planar straight-line grid drawings of binary trees. Let T be a binary tree with n nodes. We show that T admits a planar straight-line grid drawing with area O(n) and with any pre-specified aspect ratio in the range [n− , n ], where is any constant, such that 0 < < ...
متن کاملOn Planar Greedy Drawings of 3-Connected Planar Graphs
A graph drawing is greedy if, for every ordered pair of vertices (x, y), there is a path from x to y such that the Euclidean distance to y decreases monotonically at every vertex of the path. Greedy drawings support a simple geometric routing scheme, in which any node that has to send a packet to a destination “greedily” forwards the packet to any neighbor that is closer to the destination than...
متن کامل